Description: 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared Platform: |
Size: 10240 |
Author:ddd |
Hits:
Description: 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data used in data Platform: |
Size: 264192 |
Author:刘斌 |
Hits:
Description: 实现老师的申请和教务科排课管理系别管理，使用情况统计-The realization of the teacher s application and the Academic Course Scheduling Management Branch of other management, usage statistics Platform: |
Size: 701440 |
Author:我的 |
Hits:
Description: 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Book from the algorithm design and algorithm analysis, starting with the basic concepts and methods, the system introduced the method of algorithm design and analysis skills. The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques. Each chapter is behind the book comes with a certain number of exercises to help readers understand and grasp the contents of the book. Platform: |
Size: 7182336 |
Author:shang |
Hits:
Description: 按自然法则计算的一个新分支：确定性退火技术
解决Job Shop调度问题的模拟退火算法改进-Calculated in accordance with the laws of nature a new branch: deterministic annealing to solve the Job Shop scheduling problem to improve the simulated annealing algorithm Platform: |
Size: 7168 |
Author:尹胜台 |
Hits:
Description: 本程序为winTC环境下编写的学生档案管理系统，包含密码保护、数据的录入、查询、修改、增加、删除、统计、排序、文件的保存和读取等模块，每个模块都有分菜单和详尽的分支函数。ALPHA、CALPHA两个文件是为您提供的测试文件，进入程序后选择“读取学生档案”，输入档案名:alpha，确定，即可读取该测试文件。该文件包含15名学生信息。-This program is prepared by students under winTC file management system, including password protection, data entry, query, modify, add, delete, statistics, scheduling, file saving and reading modules, each module has a sub-menu and detailed branch function. ALPHA, CALPHA two documents is to provide you with the test file, enter the program and select " Read student file" , enter the file name: alpha, OK, you can read the test file. This file contains information on 15 students. Platform: |
Size: 7168 |
Author:William |
Hits:
Description: 分支限界法解决批处理作业调度问题
算法分析与设计-Branch and bound method to solve the problem of batch job scheduling Platform: |
Size: 628736 |
Author:薛佩佩 |
Hits:
Description: The Class Scheduling Problem (CSP) is concerned with assigning a number
of courses corresponding to various students and instructors to classrooms
taking into consideration constraints like classroom capacities and
university regulations. The problem also attempts to optimize the
performance criteria and distribute the courses fairly to classrooms
depending on the ratio of classroom capacities to course enrollments. The
problem is a classical scheduling problem and considered to be NP‐
complete. It has received some research during the past few years given its
wide use in colleges and universities. Several formulations and algorithms
have been proposed to solve scheduling problems, most of which are based
on local search techniques.
In this project, we use a hybrid algorithm which combines features of
Genetic algorithm and Branch and Bound algorithm to solve the class
scheduling problem.
-The Class Scheduling Problem (CSP) is concerned with assigning a number
of courses corresponding to various students and instructors to classrooms
taking into consideration constraints like classroom capacities and
university regulations. The problem also attempts to optimize the
performance criteria and distribute the courses fairly to classrooms
depending on the ratio of classroom capacities to course enrollments. The
problem is a classical scheduling problem and considered to be NP‐
complete. It has received some research during the past few years given its
wide use in colleges and universities. Several formulations and algorithms
have been proposed to solve scheduling problems, most of which are based
on local search techniques.
In this project, we use a hybrid algorithm which combines features of
Genetic algorithm and Branch and Bound algorithm to solve the class
scheduling problem.
Platform: |
Size: 41984 |
Author:masmur |
Hits:
Description: 优化技术是一种以数学为基础，用于求解各种工程问题优化解的应用技术。作为一个重要的科学分支，它一直受到人们的广泛重视，并在诸多工程领域得到迅速推广和应用，如系统控制、人工智能、模式识别、生产调度、VLSI技术和计算机工程等。鉴于实际工程问题的复杂性、约束性、非线性、多极小、建模困难等特点，寻求一种适合于大规模并行且具有智能特征的算法已成为有关学科的一个主要研究目标和引人注目的研究方向。 20世纪80年代以来，一些新颖的优化算法，如人工神经网络、混沌、遗传算法、进化。(Optimization technique is an application technique based on mathematics, which is used to solve the optimization problems of various engineering problems. As an important branch of science, it has been paid more and more attention, and has been rapidly popularized and applied in many engineering fields, such as system control, artificial intelligence, pattern recognition, production scheduling, VLSI technology and computer engineering, etc.. In view of the complexity, constraints, nonlinearity, multi minima and modeling difficulties of practical engineering problems, searching for a large-scale parallel and intelligent algorithm has become one of the main research objectives and attractive research directions. Since 1980s, some novel optimization algorithms, such as artificial neural network, chaos, genetic algorithms, evolutionary programming.) Platform: |
Size: 2027520 |
Author:韬文
|
Hits:
Search - scheduling Branch